Polynomial approximation to integral transforms
نویسندگان
چکیده
منابع مشابه
Approximation of hypersingular integral transforms on the real axis
where wα,β(x) = |x|αe−|x| β is a generalized Freud weight with α ≥ 0, β > 1 and 0 ≤ p ∈ N. This topic is of interest, for instance, in the numerical solution of hypersingular integral equations, which are often models for physics and engineering problems (see [5, 2, 4]). To our knowledge, most of the papers available in the literature deal with the approximation of Hadamard integrals on bounded...
متن کاملFrom Local Polynomial Approximation to Pointwise Shape-adaptive Transforms: an Evolutionary Nonparametric Regression Perspective
In this paper we review and discuss some of the theoretical and practical aspects, the problems, and the considerations that pushed our research from the one-dimensional LPA-ICI (local polynomial approximation interesection of conÞdence intervals) algorithm [27] to the development of powerful transform-based methods for anisotropic image processing [18, 15, 19, 20, 8, 21]. In this paper we do n...
متن کاملHenstock-Kurzweil Integral Transforms
Copyright q 2012 Salvador Sánchez-Perales et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We show conditions for the existence, continuity, and differentiability of functions defined by ΓΓs ∞ −∞ ftgt, sdt, where f is a func...
متن کاملGlobal Behavior of Integral Transforms
It should be remarked that asymptotic estimates of the behavior of the sine and of other integral transforms of regularly varying functions [6] in terms of the function f (1/x) had been obtained before [7–9], both as x → 0 and as x →∞. However, (1.1) is a global estimate that not only considers the endpoint behavior but also holds for all x > 0. Our aim in this article is to generalize (1.1) in...
متن کاملA Polynomial - Time Reduction from Bivariate to Univariate Integral Polynomial
A Abstract n algorithm is presented which reduces the prob-m lem of finding the irreducible factors of a bivariate polyno-ial with integer coefficients in polynomial time in the total i degree and the coefficient lengths to factoring a univariate nteger polynomial. Together with A. Lenstra's, H. Lenstra's u and L. Lovasz' polynomial-time factorization algorithm for nivariate integer polynomials...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1971
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-12-1-91-101